Comp760, Summary of Lecture 20
نویسنده
چکیده
The material for today’s lecture is from [BGPW13]. Determining the 0-error internal information cost of the AND function is considerably more difficult that determining its external information cost. At the first glance it might seem surprising that one can do something different from the protocol that we discussed in the external case. First we state a protocol that is optimal for the case of symmetric μ, i.e. μ(01) = μ(10). The protocol as it is described below is not a conventional protocol. It has access to a clock that continuously increases from 0 to 1.
منابع مشابه
Comp760, Summary of Lecture 15
We can think of these as communication tasks. Note that all the above definitions require something about the distribution of (X,Y, π(X,Y )). In the following definition we attempt to formally define a communication task. This is going to be useful when we discuss the direct sum theorems. However, the formalism of Definition 1 is not very essential for our purpose and the natural intuition that...
متن کاملComp760, Summary of Lecture 17
In this lecture we will discuss how to compress a protocol with low information cost, but possibly very high communication cost, to a protocol with low communication cost. It will be important to understand how much information is revealed at every step of the protocol. Thus we will take a closer look at the protocol tree, and we shall try to break the information cost into an expression in ter...
متن کاملComp760, Lectures 12-13: Reverse Bonami-beckner and Expansion, Gaussian Space
In this lecture we are going to address a question related to expansion. We choose an element in a product space and change each coordinate with a small probability. How large is the probability that starting in a given small set A, the new point lands in another small set B? We are going to prove a lower bound on this probability that depends on the relative densities of such sets. To this end...
متن کاملComp760, Summary of Lecture 12
In 1948, Shannon in his seminal paper [Sha48] introduced information theory as a tool for studying the communication cost of transmission tasks. In this setting, Alice receives a random input X ∼ (Ω, p) and wants to transmit it to Bob. Shannon’s source coding theorem (Theorem 2 below) concerns the case where Alice is sending many copies of X. More precisely, she receives (X1, . . . , Xn) where ...
متن کامل